SOLVING THE NONLINEAR DISCRETE TRANSPORTATION PROBLEM BY MINLP OPTIMIZATION
نویسندگان
چکیده
منابع مشابه
MINLP optimization model for the nonlinear discrete time-cost trade-off problem
This paper presents the mixed-integer nonlinear programming (MINLP) optimization model for the nonlinear discrete time–cost trade-off problem (NDTCTP). The nonlinear total project cost objective function of the proposed MINLP optimization model is subjected to a rigorous system of generalized precedence relationship constraints between project activities, project duration constraints, logical c...
متن کاملSolving the Fixed Charge Transportation Problem by New Heuristic Approach
The fixed charge transportation problem (FCTP) is a deployment of the classical transportation problem in which a fixed cost is incurred, independent of the amount transported, along with a variable cost that is proportional to the amount shipped. Since the problem is considered as an NP-hard, the computational time grows exponentially as the size of the problem increases. In this pape...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولSolving the Airline Recovery Problem By Using Ant Colony Optimization
In this paper an Ant Colony (ACO) algorithm is developed to solve aircraft recovery while considering disrupted passengers as part of objective function cost. By defining the recovery scope, the solution always guarantees a return to the original aircraft schedule as soon as possible which means least changes to the initial schedule and ensures that all downline affects of the disruption are ...
متن کاملHierarchical Problem Solving by the Bayesian Optimization Algorithm Hierarchical Problem Solving by the Bayesian Optimization Algorithm
The paper discusses three major issues. First, it discusses why it makes sense to approach problems in a hierarchical fashion. It deenes the class of hierarchically decomposable functions that can be used to test the algorithms that approach problems in this fashion. Finally, the Bayesian optimization algorithm (BOA) is extended in order to solve the proposed class of problems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TRANSPORT
سال: 2013
ISSN: 1648-4142,1648-3480
DOI: 10.3846/16484142.2013.815134